Decision lists and related Boolean functions
نویسندگان
چکیده
منابع مشابه
Decision lists and related Boolean functions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decision lists has interesting relationships to independently defined classes such as disguised Horn functions, readonce functions, nested differences of concepts, threshold functions, and 2-monotonic functions. In particul...
متن کاملDecision Tree Approximations of Boolean Functions
Decision trees are popular representations of Boolean functions. We show that, given an alternative representation of a Boolean function f , say as a read-once branching program, one can find a decision tree T which approximates f to any desired amount of accuracy. Moreover, the size of the decision tree is at most that of the smallest decision tree which can represent f and this construction c...
متن کاملBinary decision diagrams for random Boolean functions
Binary Decision Diagrams (BDDs) are a data structure for Boolean functions which are also known as branching programs. In ordered binary decision diagrams (OBDDs), the tests have to obey a fixed variable ordering. In free binary decision diagrams (FBDDs), each variable can be tested at most once. The efficiency of new variants of the BDD concept is usually demonstrated with spectacular (worst-c...
متن کاملPairing Functions, Boolean Evaluation and Binary Decision Diagrams
A “pairing function” J associates a unique natural number z to any two natural numbers x,y such that for two “unpairing functions” K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural number representations of truth tables, we derive an encoding for Binary Decision Diagrams with the unique property that its boolean evaluation faithfully mi...
متن کاملPairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog
A “pairing function” J associates a unique natural number z to any two natural numbers x,y such that for two “unpairing functions” K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural number representations of truth tables, we derive an encoding for Binary Decision Diagrams with the unique property that its boolean evaluation faithfully mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00003-2